Numerical stability of Lanczos methods
نویسندگان
چکیده
منابع مشابه
Lanczos Methods in SLEPc
About SLEPc Technical Reports: These reports are part of the documentation of slepc, the Scalable Library for Eigenvalue Problem Computations. They are intended to complement the Users Guide by providing technical details that normal users typically do not need to know but may be of interest for more advanced users.
متن کاملThe Numerical Stability of Kernel Methods
Kernel methods use kernel functions to provide nonlinear versions of different methods in machine learning and data mining, such as Principal Component Analysis and Support Vector Machines. These kernel functions require the calculation of some or all of the entries of a matrix of the form XX . The formation of this type of matrix is known to result in potential numerical instability in the cas...
متن کاملAdjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods
In a semiorthogonal Lanczos algorithm, the orthogonality of the Lanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon 4] shows that the Rayleigh quotient | i.e., the tridiagonal matrix produced by the Lanczos recursion | contains fully accurate approximations to the Ritz values in spite...
متن کاملOn the Numerical Stability Analysis of Pipelined Krylov Subspace Methods
Algebraic solvers based on preconditioned Krylov subspace methods are among the most powerful tools for large scale numerical computations in applied mathematics, sciences, technology, as well as in emerging applications in social sciences. The study of mathematical properties of Krylov subspace methods, in both the cases of exact and inexact computations, is a very active area of research and ...
متن کاملNumerical evaluation of the Communication-Avoiding Lanczos algorithm
The Lanczos algorithm is widely used for solving large sparse symmetric eigenvalue problems when only a few eigenvalues from the spectrum are needed. Due to sparse matrix-vector multiplications and frequent synchronization, the algorithm is communication intensive leading to poor performance on parallel computers and modern cache-based processors. The Communication-Avoiding Lanczos algorithm [H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B - Proceedings Supplements
سال: 2000
ISSN: 0920-5632
DOI: 10.1016/s0920-5632(00)91816-4